Cryptographically secure detection of mirror worlds

Yale University Department of Computer Science A Robust and Verifiable Cryptographically Secure Election Scheme ( Extended

Implementation Issues in Secure E-voting Schemes

As cheating is an inherent threat to voting, it is essential that an e-voting system provides a high level of security. At the moment, commercially available e-voting solutions mainly advertise their convenience, efficiency and low cost. On the other hand, cryptographically secure voting schemes in the literature are generally considered to be complex and inefficient for a real-world implementa...

An Overview of Cryptographically Secure Pseudorandom Number generators and BBS

In this manuscript we have presented a literature survey of cryptographically securepseudo random number generators, their requirements regarding statistical properties and next bit test. The paper also provides a brief overview of Blum Blum Shub (BBS) Generator specifically, which is considered to be the best cryptographically secure pseudorandom number generator. We have performed the rigorou...

Cryptographically strong pseudo-random bit generators constructed using finite fields

1

Cryptographically Secure Bloom-Filters

In this paper, we propose a privacy-preserving variant of Bloom-filters. The Bloom-filter has many applications such as hash-based IP-traceback systems and Web cache sharing. In some of those applications, equipping the Bloom-filter with the privacy-preserving mechanism is crucial for the deployment. In this paper, we propose a cryptographically secure privacy-preserving Bloom-filter protocol. ...